The Convex Hull of a Quadratic Constraint over a Polytope
نویسندگان
چکیده
منابع مشابه
A Semidefinite Optimization Approach to Quadratic Fractional Optimization with a Strictly Convex Quadratic Constraint
In this paper we consider a fractional optimization problem that minimizes the ratio of two quadratic functions subject to a strictly convex quadratic constraint. First using the extension of Charnes-Cooper transformation, an equivalent homogenized quadratic reformulation of the problem is given. Then we show that under certain assumptions, it can be solved to global optimality using semidefini...
متن کاملOn the convex hull of random points in a polytope
'This research was sponsored by the National Science Foundation under Grant No. ECS-8418392. The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed or implied, of the National Science Foundation or the US Government. On the Convex Hull of Random Points in a Polytope R e x A . D w y e r * ...
متن کاملThe Integer Hull of a Convex Rational Polytope
Given A ∈ Zm×n and b ∈ Z, we consider the integer program max{c′x|Ax = b;x ∈ N} and provide an equivalent and explicit linear program max{ĉ′q|Mq = r; q ≥ 0}, where M, r, ĉ are easily obtained from A, b, c with no calculation. We also provide an explicit algebraic characterization of the integer hull of the convex polytope P = {x ∈ R|Ax = b;x ≥ 0}. All strong valid inequalities can be obtained f...
متن کاملConvex hull of two quadratic or a conic quadratic and a quadratic inequality
In this paper we consider an aggregation technique introduced by Yıldıran [45] to study the convex hull of regions defined by two quadratic inequalities or by a conic quadratic and a quadratic inequality. Yıldıran [45] shows how to characterize the convex hull of open sets defined by two strict quadratic inequalities using Linear Matrix Inequalities (LMI). We show how this aggregation technique...
متن کاملDerivative of an integral over a convex polytope
Many problems in optimization lead to a cost function in the form of an integral over a polytope. To find the gradient or Hessian of such costs one needs to take the derivative of an integral over a convex polytope with respect to the parameters defining the polytope. The contribution of the current paper is to present a formula for such derivatives.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2020
ISSN: 1052-6234,1095-7189
DOI: 10.1137/19m1277333